Parallel multilevel fast multipole method for solving large-scale problems

The Multilevel Fast Multipole Method (FMM) is a well-established method and can be applied to solve electromagnetic (EM) scattering problems. Compared with other traditional methods, it requires less computational time and memory. However, constrained by a single processor's speed and memory limitations, the problem size that can be solved by serial implementation is still relatively small. For a million-unknown target, the computational time on a single processor is intolerable, and memory could be easily exhausted. Parallel-computing technology, which can utilize multiprocessors, provides an efficient way to solve electrically large-scale EM problems. This paper will focus on discussing the parallel methodologies applied to a multilevel FMM code, as well as demonstrating the computational efficiency of the parallel approach.     

Characterization of dynamic behavior of a spout-fluid bed with Shannon entropy analysis

Differential pressure fluctuation time series were obtained at different locations in a two-dimensional spout-fluid bed with a cross section of 300 × 30 mm and height 2000 mm. Shannon entropy analysis of differential pressure fluctuations was developed to characterize the dynamic behavior. Effects of two important operating parameters (spouting gas velocity and fluidizing gas flow rate) on the Shannon entropy were examined. It was demonstrated that a spout-fluid bed at a high spouting gas velocity or fluidizing gas flow rate was a deterministic chaos system since the Shannon entropies at all bed locations increased sharply and asymmetric unstable flows occurred. Shannon entropies were found to be significantly different at various bed locations. Shannon entropies of different flow regimes were distinct, so they were used to identify the flow regimes. The results show that the Shannon entropy helps to grasp the complex characteristics of dynamic behavior in spout-fluid beds.     

对称非线性系统的无交互控制

本文讨论了具有对称性的非线性系统的无交互控制问题。通过定义对称系统的导出分布族的新概念,我们得出了问题可解的条件。我们取得的结果较不具对称性的情况要简单一些。从而说明,对称性不仅使得系统具有较好的结构,而且使得它的其它一些问题的研究得到简化。     

Conflict detection and resolution in two-dimensional prefix router tables

We show that determining the minimum number of resolve filters that need to be added to a set of two-dimensional (2-D) prefix filters so that the filter set can implement a given policy using the first-matching-rule-in-table tie breaker is NP-hard. Additionally, we develop a fast O(nlogn+s) time, where n is the number of filters and s is the number of conflicts, plane-sweep algorithm to detect and report all pairs of conflicting 2-D prefix filters. The space complexity of our algorithm is O(n). On our test set of 15 2-D filter sets, our algorithm runs between 4 and 17 times as fast as the 2-D trie algorithm of A. Hari et al. (2000) and uses between 1/4th and 1/8th the memory used by the algorithm of Hari et al. On the same test set, our algorithm is between 4 and 27 times as fast as the bit-vector algorithm of Baboescu and Varghese (2002) and uses between 1/205 and 1/6 as much memory. We introduce the notion of an essential resolve filter and develop an efficient algorithm to determine the essential resolve filters of a prefix filter set.     

种分Δαk与种分首槽αk的关系

针对烧结法和拜尔法种分槽的 Δαk 变化进行了概述 ,阐述了种分 Δαk 与种分首槽 αk 的关系。     

创建学习型企业,加强职工培训工作

本文对广钢创建学习型企业和搞好职工培训工作的问题进行了探讨，提出了在创建学习型企业过程中，加强和改进职工培训工作的思路和办法。     

天铁炼钢厂四流中间包流场的水模实验及优化

介绍了天铁炼钢厂中间包水模实验原理和过程，分析了斜、直、圆三种型式挡渣墙模拟结果，提出了合理的挡渣控流方案，在生产实践中使用效果良好。     

聚乙烯丙纶复合防水卷材的特点及其应用

介绍了聚乙烯丙纶复合防水卷材的产品结构特点和性能特点、防水系统结构特点和配套材料、应用拼接技术以及产品应用范围。     

煤系高岭土制备裂化催化剂的探索性研究

从石嘴山煤系高岭土的分析测实,经过改性处理,实验后得出具有碱改性条件,且制备裂化催化剂后重油转化能力有明显提高,开拓了煤系高岭土在石化领域的应用。     

An Algorithm For Selecting a Generator of Z_p

How to select a generator of Zp* is an important problem in cryptographic applications, where p is an odd prime. In this paper, we mainly consider the especial case that p is a safe prime, and give an algorithm for selecting a generator of Zp*,and find all generators of Zp* , where p is a safe prime. Our algorithm is more faster than the algorithm in [1]. Based on the proposed algorithm, one could find all generators of Zp* as well, where p is a perfect prime.